HOMOGENEOUS MULTILINEAR FUNCTIONS ON HYPERGRAPH CLIQUES
نویسندگان
چکیده
منابع مشابه
Hypergraph Ramsey numbers: Triangles versus cliques
A celebrated result in Ramsey Theory states that the order of magnitude of the trianglecomplete graph Ramsey numbers R(3, t) is t/ log t. In this paper, we consider an analogue of this problem for uniform hypergraphs. A triangle is a hypergraph consisting of edges e, f, g such that |e∩ f | = |f ∩ g| = |g ∩ e| = 1 and e ∩ f ∩ g = ∅. For all r ≥ 2, let R(C3,K t ) be the smallest positive integer ...
متن کاملHypergraph Ramsey numbers: tight cycles versus cliques
For s ≥ 4, the 3-uniform tight cycle C s has vertex set corresponding to s distinct points on a circle and edge set given by the s cyclic intervals of three consecutive points. For fixed s ≥ 4 and s 6≡ 0 (mod 3) we prove that there are positive constants a and b with 2 < r(C s ,K 3 t ) < 2 bt log . The lower bound is obtained via a probabilistic construction. The upper bound for s > 5 is proved...
متن کاملOn Polynomial Representation Functions for Multilinear Forms
Given an infinite sequence of positive integers A, we prove that for every nonnegative integer k the number of solutions of the equation n = a1+ · · ·+ak, a1, . . . , ak ∈ A, is not constant for n large enough. This result is a corollary of our main theorem, which partially answers a question of Sárközy and Sós on representation functions for multilinear forms. The main tool used in the argumen...
متن کاملThe Grötzsch Theorem for the Hypergraph of Maximal Cliques
In this paper, we extend the Grötzsch Theorem by proving that the clique hypergraph H(G) of every planar graph is 3-colorable. We also extend this result to list colorings by proving that H(G) is 4-choosable for every planar or projective planar graph G. Finally, 4-choosability ofH(G) is established for the class of locally planar graphs on arbitrary surfaces.
متن کاملThe Grötzsch Theorems for the Hypergraph of Maximal Cliques
In this paper, we extend the Grötzsch Theorem by proving that the clique hypergraph H(G) of every planar graph is 3-colorable. We also extend this result to list colorings by proving that H(G) is 4-choosable for every planar or projective planar graph G. Finally, 4-choosability of H(G) is established for the class of locally planar graphs on arbitrary surfaces.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Korean Mathematical Society
سال: 2017
ISSN: 1015-8634
DOI: 10.4134/bkms.b160474